Adding some more judges, here and there.

[and.git] / lib / Mi manual de algoritmos / version_world_finals_2009 / manual.aux

\relax 
\catcode`.\active
\catcode`\.=12
\catcode`"\active
\catcode`<\active
\catcode`>\active
\es@quoting
\ifx\hyper@anchor\@undefined
\global \let \oldcontentsline\contentsline
\gdef \contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global \let \oldnewlabel\newlabel
\gdef \newlabel#1#2{\newlabelxx{#1}#2}
\gdef \newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\let \contentsline\oldcontentsline
\let \newlabel\oldnewlabel}
\else
\global \let \hyper@last\relax 
\fi

\select@language{spanish}
\@writefile{toc}{\select@language{spanish}}
\@writefile{lof}{\select@language{spanish}}
\@writefile{lot}{\select@language{spanish}}
\@writefile{toc}{\contentsline {section}{\numberline {1}Plantilla}{2}{section.1}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Teor\IeC {\'\i }a de n\IeC {\'u}meros}{2}{section.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Big mod}{2}{subsection.2.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Criba de Erat\IeC {\'o}stenes}{2}{subsection.2.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Divisores de un n\IeC {\'u}mero}{3}{subsection.2.3}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Combinatoria}{3}{section.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Cuadro resumen}{3}{subsection.3.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Combinaciones, coeficientes binomiales, tri\IeC {\'a}ngulo de Pascal}{3}{subsection.3.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Permutaciones con elementos indistinguibles}{4}{subsection.3.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Desordenes, desarreglos o permutaciones completas}{4}{subsection.3.4}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Grafos}{4}{section.4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Algoritmo de Dijkstra}{4}{subsection.4.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Minimum spanning tree: Algoritmo de Prim}{5}{subsection.4.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Minimum spanning tree: Algoritmo de Kruskal + Union-Find}{5}{subsection.4.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4}Algoritmo de Floyd-Warshall}{6}{subsection.4.4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.5}Algoritmo de Bellman-Ford}{6}{subsection.4.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.6}Puntos de articulaci\IeC {\'o}n}{7}{subsection.4.6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.7}M\IeC {\'a}ximo flujo: M\IeC {\'e}todo de Ford-Fulkerson, algoritmo de Edmonds-Karp}{8}{subsection.4.7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.8}M\IeC {\'a}ximo flujo para grafos dispersos usando Ford-Fulkerson}{9}{subsection.4.8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.9}M\IeC {\'a}ximo flujo para grafos disperos usando algoritmo de Dinic}{10}{subsection.4.9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.10}M\IeC {\'a}ximo flujo m\IeC {\'\i }nimo costo}{11}{subsection.4.10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.11}Componentes fuertemente conexas: Algoritmo de Tarjan}{12}{subsection.4.11}}
\newlabel{tarjan}{{4.11}{12}{Componentes fuertemente conexas: Algoritmo de Tarjan\relax }{subsection.4.11}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.12}2-Satisfiability}{13}{subsection.4.12}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Programaci\IeC {\'o}n din\IeC {\'a}mica}{13}{section.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Longest common subsequence}{13}{subsection.5.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Partici\IeC {\'o}n de troncos}{13}{subsection.5.2}}
\@writefile{toc}{\contentsline {section}{\numberline {6}Geometr\IeC {\'\i }a}{14}{section.6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.1}\IeC {\'A}rea de un pol\IeC {\'\i }gono}{14}{subsection.6.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2}Centro de masa de un pol\IeC {\'\i }gono}{15}{subsection.6.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.3}Convex hull: Graham Scan}{15}{subsection.6.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.4}Convex hull: Andrew's monotone chain}{16}{subsection.6.4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.5}M\IeC {\'\i }nima distancia entre un punto y un segmento}{16}{subsection.6.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.6}M\IeC {\'\i }nima distancia entre un punto y una recta}{17}{subsection.6.6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.7}Determinar si un pol\IeC {\'\i }gono es convexo}{17}{subsection.6.7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.8}Determinar si un punto est\IeC {\'a} dentro de un pol\IeC {\'\i }gono convexo}{17}{subsection.6.8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.9}Determinar si un punto est\IeC {\'a} dentro de un pol\IeC {\'\i }gono cualquiera}{18}{subsection.6.9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.10}Intersecci\IeC {\'o}n de dos rectas}{19}{subsection.6.10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.11}Intersecci\IeC {\'o}n de dos segmentos de recta}{19}{subsection.6.11}}
\@writefile{toc}{\contentsline {section}{\numberline {7}Estructuras de datos}{20}{section.7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.1}\IeC {\'A}rboles de Fenwick \IeC {\'o} Binary indexed trees}{20}{subsection.7.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.2}Segment tree}{20}{subsection.7.2}}
\@writefile{toc}{\contentsline {section}{\numberline {8}Miscel\IeC {\'a}neo}{21}{section.8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {8.1}El \textit  {parser} m\IeC {\'a}s r\IeC {\'a}pido del mundo}{21}{subsection.8.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {8.2}Checklist para corregir un Wrong Answer}{22}{subsection.8.2}}
\@writefile{toc}{\contentsline {section}{\numberline {9}Java}{22}{section.9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.1}Entrada desde entrada est\IeC {\'a}ndar}{22}{subsection.9.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.2}Entrada desde archivo}{23}{subsection.9.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.3}Mapas y sets}{23}{subsection.9.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.4}Colas de prioridad}{24}{subsection.9.4}}
\newlabel{colas_de_prioridad_java}{{9.4}{24}{Colas de prioridad\relax }{subsection.9.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {10}C++}{25}{section.10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {10.1}Entrada desde archivo}{25}{subsection.10.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {10.2}Strings con caract\IeC {\'e}res especiales}{25}{subsection.10.2}}